全文获取类型
收费全文 | 23973篇 |
免费 | 1678篇 |
国内免费 | 1088篇 |
专业分类
化学 | 1495篇 |
晶体学 | 30篇 |
力学 | 2492篇 |
综合类 | 301篇 |
数学 | 19745篇 |
物理学 | 2676篇 |
出版年
2024年 | 37篇 |
2023年 | 237篇 |
2022年 | 358篇 |
2021年 | 533篇 |
2020年 | 507篇 |
2019年 | 533篇 |
2018年 | 607篇 |
2017年 | 699篇 |
2016年 | 667篇 |
2015年 | 502篇 |
2014年 | 1069篇 |
2013年 | 1696篇 |
2012年 | 1241篇 |
2011年 | 1235篇 |
2010年 | 1129篇 |
2009年 | 1514篇 |
2008年 | 1530篇 |
2007年 | 1620篇 |
2006年 | 1365篇 |
2005年 | 1129篇 |
2004年 | 936篇 |
2003年 | 973篇 |
2002年 | 864篇 |
2001年 | 688篇 |
2000年 | 698篇 |
1999年 | 584篇 |
1998年 | 574篇 |
1997年 | 518篇 |
1996年 | 366篇 |
1995年 | 358篇 |
1994年 | 267篇 |
1993年 | 230篇 |
1992年 | 213篇 |
1991年 | 184篇 |
1990年 | 150篇 |
1989年 | 99篇 |
1988年 | 90篇 |
1987年 | 79篇 |
1986年 | 79篇 |
1985年 | 108篇 |
1984年 | 108篇 |
1983年 | 42篇 |
1982年 | 51篇 |
1981年 | 46篇 |
1980年 | 39篇 |
1979年 | 51篇 |
1978年 | 35篇 |
1977年 | 44篇 |
1976年 | 26篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
31.
Volker Elling. 《Mathematics of Computation》2006,75(256):1721-1733
A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.
32.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
33.
Maria Kordaki Athanasia Balomenou 《International Journal of Computers for Mathematical Learning》2006,11(1):99-135
This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment. 相似文献
34.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
35.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
36.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
37.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
38.
39.
结合生产实际中具体的下料问题,本文建立了该类问题的优化模型,并提出下料方式的遴选三准则,即高利用率优先准则,长度优先准则和时间优先准则.运用本文的算法对一维下料的利用率高达99.6%,机器时间4秒.对二维的利用率为98.9%,机器时间约7秒. 相似文献
40.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献